Efficient Secure Computation from SM Series Cryptography

The wireless network suffers from many security problems, and computation in a environment may fail to preserve privacy as well correctness when the adversaries conduct attacks through backdoors, steganography, kleptography, etc. Secure ensures execution such an environment, compared with on plaintext, performance of secure is bounded by underlying cryptographic algorithms between involved parties. Besides, Chinese cryptography laws require that appeared commercial market be authorized. In this work, we show how implement oblivious transfer (OT), important primitive multiparty (MPC), using government-approved SM2 SM3 algorithms. algorithm based elliptic curve much faster than discrete logarithm-based solutions. Moreover, adopting standard OT extension technique, can extend number OTs efficiently one more round communication invocations SM4 used Beaver multiplication triple generation other MPC protocols, e.g., private set intersection. Therefore, utilize SM series cryptography, specifically, SM2, SM3, algorithms, build highly efficient frameworks which are suitable for applications China. experimental evaluation results our protocols have comparable existing protocols; quite bad environments.